On multiplicative functions which are small on average

Let $f$ be a completely multiplicative function that assumes values inside the unit disc. We show that if \sum_{n2, for some $A>2$, then either $f(p)$ is small on average or $f$ pretends to be $\mu(n)n^{it}$ for some $t$.Comment: 51 pages. Slightly strengthened Theorem 1.2 and simplified its statement. Removed Remark 1.3. Other minor changes and corrections. To appear in Geom. Funct. Ana

Bandlimited approximations to the truncated Gaussian and applications

In this paper we extend the theory of optimal approximations of functions $f: \R \to \R$ in the $L^1(\R)$-metric by entire functions of prescribed exponential type (bandlimited functions). We solve this problem for the truncated and the odd Gaussians using explicit integral representations and fine properties of truncated theta functions obtained via the maximum principle for the heat operator. As applications, we recover most of the previously known examples in the literature and further extend the class of truncated and odd functions for which this extremal problem can be solved, by integration on the free parameter and the use of tempered distribution arguments. This is the counterpart of the work \cite{CLV}, where the case of even functions is treated.Comment: to appear in Const. Appro

Improved model identification for non-linear systems using a random subsampling and multifold modelling (RSMM) approach

In non-linear system identification, the available observed data are conventionally partitioned into two parts: the training data that are used for model identification and the test data that are used for model performance testing. This sort of 'hold-out' or 'split-sample' data partitioning method is convenient and the associated model identification procedure is in general easy to implement. The resultant model obtained from such a once-partitioned single training dataset, however, may occasionally lack robustness and generalisation to represent future unseen data, because the performance of the identified model may be highly dependent on how the data partition is made. To overcome the drawback of the hold-out data partitioning method, this study presents a new random subsampling and multifold modelling (RSMM) approach to produce less biased or preferably unbiased models. The basic idea and the associated procedure are as follows. First, generate K training datasets (and also K validation datasets), using a K-fold random subsampling method. Secondly, detect significant model terms and identify a common model structure that fits all the K datasets using a new proposed common model selection approach, called the multiple orthogonal search algorithm. Finally, estimate and refine the model parameters for the identified common-structured model using a multifold parameter estimation method. The proposed method can produce robust models with better generalisation performance

Some extremal functions in Fourier analysis, III

We obtain the best approximation in $L^1(\R)$, by entire functions of exponential type, for a class of even functions that includes $e^{-\lambda|x|}$, where $\lambda >0$, $\log |x|$ and $|x|^{\alpha}$, where $-1 < \alpha < 1$. We also give periodic versions of these results where the approximating functions are trigonometric polynomials of bounded degree.Comment: 26 pages. Submitte

Close to Uniform Prime Number Generation With Fewer Random Bits

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$, where only $t$ is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.L. Montgomery, made precise by Friedlander and Granville; then the Extended Riemann Hypothesis; and finally fully unconditionally using the Barban-Davenport-Halberstam theorem. We argue that this approach has a number of desirable properties compared to previous algorithms.Comment: Full version of ICALP 2014 paper. Alternate version of IACR ePrint Report 2011/48

On some problems involving Hardy's function

Some problems involving the classical Hardy function $$Z(t) := \zeta(1/2+it)\bigl(\chi(1/2+it)\bigr)^{-1/2}, \quad \zeta(s) = \chi(s)\zeta(1-s)$$ are discussed. In particular we discuss the odd moments of $Z(t)$, the distribution of its positive and negative values and the primitive of $Z(t)$. Some analogous problems for the mean square of $|\zeta(1/2+it)|$ are also discussed.Comment: 15 page

Short proofs of some extremal results III

We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are reasonably short

Elliptic curves of large rank and small conductor

For r=6,7,...,11 we find an elliptic curve E/Q of rank at least r and the smallest conductor known, improving on the previous records by factors ranging from 1.0136 (for r=6) to over 100 (for r=10 and r=11). We describe our search methods, and tabulate, for each r=5,6,...,11, the five curves of lowest conductor, and (except for r=11) also the five of lowest absolute discriminant, that we found.Comment: 16 pages, including tables and one .eps figure; to appear in the Proceedings of ANTS-6 (June 2004, Burlington, VT). Revised somewhat after comments by J.Silverman on the previous draft, and again to get the correct page break

Bishop and Laplacian Comparison Theorems on Three Dimensional Contact Subriemannian Manifolds with Symmetry

We prove a Bishop volume comparison theorem and a Laplacian comparison theorem for three dimensional contact subriemannian manifolds with symmetry